翻訳と辞書 Words near each other ・ Proposition 204 ・ Proposition 2½ ・ Proposition 31 ・ Proposition 48 ・ Proposition 48 (NCAA) ・ Proposition 7 ・ Proposition 8 (disambiguation) ・ Proposition bet ・ Proposition for a Revolution ・ Proposition Infinity ・ Proposition Joe ・ Proposition Player ・ Proposition U ・ Propositional attitude ・ Propositional calculus ・ Propositional directed acyclic graph ・ Propositional formula ・ Propositional function ・ Propositional proof system ・ Propositional representation ・ Propositional variable ・ Propositiones ad Acuendos Juvenes ・ Propositions (album) ・ Propositive mood ・ Proposta per les Illes ・ Propoxate ・ Propoxur ・ Propoxycaine ・ Propp ・ ProppaNOW Dictionary Lists mini英和辞書 mini和英辞書 Webster 1913 Latin-English FOLDOC Wikipedia English ウィキペディア

翻訳と辞書　辞書検索 [ 開発暫定版 ] スポンサード リンク Propositional directed acyclic graph ： ウィキペディア英語版 Propositional directed acyclic graph A propositional directed acyclic graph (PDAG) is a data structure that is used to represent a Boolean function. A Boolean function can be represented as a rooted, directed acyclic graph of the following form: * Leaves are labeled with $\backslash top$ (true), $\backslash bot$ (false), or a Boolean variable. * Non-leaves are $\backslash bigtriangleup$ (logical and), $\backslash bigtriangledown$ (logical or) and $\backslash Diamond$ (logical not). * $\backslash bigtriangleup$- and $\backslash bigtriangledown$-nodes have at least one child. * $\backslash Diamond$-nodes have exactly one child. Leaves labeled with $\backslash top$ ($\backslash bot$) represent the constant Boolean function which always evaluates to 1 (0). A leaf labeled with a Boolean variable $x$ is interpreted as the assignment $x=1$, i.e. it represents the Boolean function which evaluates to 1 if and only if $x=1$. The Boolean function represented by a $\backslash bigtriangleup$-node is the one that evaluates to 1, if and only if the Boolean function of all its children evaluate to 1. Similarly, a $\backslash bigtriangledown$-node represents the Boolean function that evaluates to 1, if and only if the Boolean function of at least one child evaluates to 1. Finally, a $\backslash Diamond$-node represents the complemenatary Boolean function its child, i.e. the one that evaluates to 1, if and only if the Boolean function of its child evaluates to 0. == PDAG, BDD, and NNF == Every binary decision diagram (BDD) and every negation normal form (NNF) are also a PDAG with some particular properties. The following pictures represent the Boolean function $f(x1,\; x2,\; x3)\; =\; -x1$ * -x2 * -x3 + x1 * x2 + x2 * x3: 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Propositional directed acyclic graph」の詳細全文を読む スポンサード リンク 翻訳と辞書 : 翻訳のためのインターネットリソース Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.